Polynomial hierarchy

Results: 38



#Item
21The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp

The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2006-11-08 15:58:52
22Communicating ASP and the Polynomial Hierarchy Kim Bauters1, , Steven Schockaert1, , Dirk Vermeir2 , and Martine De Cock1 1 Department of Applied Mathematics and Computer Science

Communicating ASP and the Polynomial Hierarchy Kim Bauters1, , Steven Schockaert1, , Dirk Vermeir2 , and Martine De Cock1 1 Department of Applied Mathematics and Computer Science

Add to Reading List

Source URL: www.cwi.ugent.be

Language: English - Date: 2011-07-25 12:41:03
23Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing

Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2005-07-07 14:54:47
24Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets.

Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets.

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2004-12-27 11:32:14
25POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#

POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2010-06-16 13:44:12
26POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl

POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2010-06-16 13:35:58
27A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided

A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2011-09-22 08:25:51
28Pottsboro Intermediate School[removed]Schedule 4th Grade Cottingame Rm 7 x330 Goncalves

Pottsboro Intermediate School[removed]Schedule 4th Grade Cottingame Rm 7 x330 Goncalves

Add to Reading List

Source URL: www.pottsboroisd.org

Language: English - Date: 2013-09-03 11:27:07
29Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation

Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2010-03-02 07:15:36
30(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry

(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2009-07-30 22:08:48